Asymmetric binary tree coding for contour images
نویسندگان
چکیده
منابع مشابه
Asymmetric binary tree coding for contour images
We consider the coding of featured contours, i.e. texture, object or motion boundaries in images. The MPEG-4 and MPEG-7 video coding standards provide for a content-based representation of video information, so efficient coding of boundaries can play an important role. We propose a new coding scheme that uses an asymmetric binary tree. We show that the new scheme outperforms conventional quadtr...
متن کاملBinary contour coding using Bézier approximation
Ahs/raCl: A method for coding of binary image contour using B6zier approximalion is proposed. A set of key pixel (guiding pixels) on the contour is defined which enables the contour to be decomposed into arcs and straight line segments. A set of cleaning operations has been considered as an intermedIate step before producing the final output. The quality of faithful reproduetion of the decoded ...
متن کاملGraded Computation Tree Logic with Binary Coding
Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths. These quantifiers naturally extend to paths the concept of graded world modali...
متن کاملSkeleton-based morphological coding of binary images
This paper presents new properties of the discrete morphological skeleton representation of binary images, along with a novel coding scheme for lossless binary image compression that is based on these properties. Following a short review of the theoretical background, two sets of new properties of the discrete morphological skeleton representation of binary images are proved. The first one lead...
متن کاملAn Alternating Binary-tree Partitioning for Fractal Image Coding
The fractal coding algorithm partitions the original image into a number of blocks. Then each block is coded by obtaining the information of the contractive transformations for the block. There are many methods of partitioning an image based on squares and rectangles such as xed-size partitioning, quad-tree partitioning, and HV partitioning. In this paper, we propose an alternating binary-tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image and Vision Computing
سال: 2003
ISSN: 0262-8856
DOI: 10.1016/s0262-8856(03)00093-3